Imperative Programming in Sets with Atoms

Ab initio Calculations SWNTs and Investigation of Interaction Atoms of Oxygen with that by Computational Calculations

In this work, theoretical investigations on carbon nanotube with oxygen atom have been carried out by firstprinciplescalculations and density functional theory and hartree fock theory in 3-216 and 6-316 basis sets. Theinteraction energy of the oxygen atom to a CNT is calculated. The effects of this substitutions have beeninvestigated on the during transplantation (10,0) single-walled carbon nan...

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

On Polymorphic Type Systems for Imperative Programming Languages: An Approach using Sets of Types and Subprograms

A Graph Model for Imperative Computation

Scott’s graph model is a lambda-algebra based on the observation that continuous endofunctions on the lattice of sets of natural numbers can be represented via their graphs. A graph is a relation mapping finite sets of input values to output values. We consider a similar model based on relations whose input values are finite sequences rather than sets. This alteration means that we are taking i...

Synchronization from a Categorical Perspective

We introduce a notion of synchronization for higher-dimensional automata, based on coskeletons of cubical sets. Categori cation transports this notion to the setting of categorical transition systems. We apply the results to study the semantics of an imperative programming language with message-passing.